TSTP Solution File: DAT333^6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : DAT333^6 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 19:47:16 EDT 2024
% Result : Theorem 0.19s 0.46s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 23
% Syntax : Number of formulae : 37 ( 14 unt; 16 typ; 0 def)
% Number of atoms : 57 ( 8 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 129 ( 8 ~; 5 |; 9 &; 103 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 33 ( 33 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 37 ( 18 ^ 15 !; 4 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
thf(decl_22,type,
mrel: mworld > mworld > $o ).
thf(decl_23,type,
mactual: mworld ).
thf(decl_24,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_26,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_30,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(decl_33,type,
mexists_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_34,type,
cs: $i ).
thf(decl_35,type,
sue: $i ).
thf(decl_36,type,
mary: $i ).
thf(decl_37,type,
john: $i ).
thf(decl_38,type,
math: $i ).
thf(decl_39,type,
psych: $i ).
thf(decl_40,type,
teach: $i > $i > mworld > $o ).
thf(decl_41,type,
esk1_1: $i > mworld ).
thf(decl_42,type,
esk2_1: mworld > $i ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mlocal_def) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mand_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X1: mworld > $o,X3: mworld] :
! [X5: mworld] :
( ( mrel @ X3 @ X5 )
=> ( X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox_def) ).
thf(mexists_di_def,axiom,
( mexists_di
= ( ^ [X8: $i > mworld > $o,X3: mworld] :
? [X7: $i] : ( X8 @ X7 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mexists_di_def) ).
thf(db,axiom,
( mlocal
@ ( mbox
@ ( mand @ ( teach @ john @ math )
@ ( mand
@ ( mexists_di
@ ^ [X7: $i] : ( teach @ X7 @ cs ) )
@ ( mand @ ( teach @ mary @ psych ) @ ( teach @ sue @ psych ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',db) ).
thf(query,conjecture,
( mlocal
@ ( mexists_di
@ ^ [X7: $i] : ( mbox @ ( teach @ john @ X7 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query) ).
thf(mrel_universal,axiom,
! [X3: mworld,X5: mworld] : ( mrel @ X3 @ X5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_universal) ).
thf(c_0_7,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_8,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_9,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_10,plain,
( mexists_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
? [X7: $i] : ( Z0 @ X7 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_di_def]) ).
thf(c_0_11,plain,
! [X14: mworld] :
( ( mrel @ mactual @ X14 )
=> ( ( teach @ john @ math @ X14 )
& ? [X13: $i] : ( teach @ X13 @ cs @ X14 )
& ( teach @ mary @ psych @ X14 )
& ( teach @ sue @ psych @ X14 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[db]),c_0_7]),c_0_8]),c_0_9]),c_0_10]) ).
thf(c_0_12,negated_conjecture,
~ ? [X12: $i] :
! [X11: mworld] :
( ( mrel @ mactual @ X11 )
=> ( teach @ john @ X12 @ X11 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query])]),c_0_7]),c_0_9]),c_0_10]) ).
thf(c_0_13,plain,
! [X17: mworld] :
( ( ( teach @ john @ math @ X17 )
| ~ ( mrel @ mactual @ X17 ) )
& ( ( teach @ ( esk2_1 @ X17 ) @ cs @ X17 )
| ~ ( mrel @ mactual @ X17 ) )
& ( ( teach @ mary @ psych @ X17 )
| ~ ( mrel @ mactual @ X17 ) )
& ( ( teach @ sue @ psych @ X17 )
| ~ ( mrel @ mactual @ X17 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
thf(c_0_14,plain,
! [X19: mworld,X20: mworld] : ( mrel @ X19 @ X20 ),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
thf(c_0_15,negated_conjecture,
! [X15: $i] :
( ( mrel @ mactual @ ( esk1_1 @ X15 ) )
& ~ ( teach @ john @ X15 @ ( esk1_1 @ X15 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
thf(c_0_16,plain,
! [X3: mworld] :
( ( teach @ john @ math @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
! [X3: mworld,X5: mworld] : ( mrel @ X3 @ X5 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
! [X7: $i] :
~ ( teach @ john @ X7 @ ( esk1_1 @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_19,plain,
! [X3: mworld] : ( teach @ john @ math @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
thf(c_0_20,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_18,c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : DAT333^6 : TPTP v8.2.0. Released v8.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 23:12:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.45 Running higher-order theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Version: 3.1.0-ho
% 0.19/0.46 # Preprocessing class: HSSSSMSSMLMNHSN.
% 0.19/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.46 # Starting sh5l with 300s (1) cores
% 0.19/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.46 # Starting new_bool_2 with 300s (1) cores
% 0.19/0.46 # sh5l with pid 24060 completed with status 0
% 0.19/0.46 # Result found by sh5l
% 0.19/0.46 # Preprocessing class: HSSSSMSSMLMNHSN.
% 0.19/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.46 # Starting sh5l with 300s (1) cores
% 0.19/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.46 # Search class: HHUNS-FFSF11-SHSSMFNN
% 0.19/0.46 # partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.19/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.46 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.46 # new_ho_10 with pid 24066 completed with status 0
% 0.19/0.46 # Result found by new_ho_10
% 0.19/0.46 # Preprocessing class: HSSSSMSSMLMNHSN.
% 0.19/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.46 # Starting sh5l with 300s (1) cores
% 0.19/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.46 # Search class: HHUNS-FFSF11-SHSSMFNN
% 0.19/0.46 # partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.19/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.46 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.46 # Preprocessing time : 0.001 s
% 0.19/0.46 # Presaturation interreduction done
% 0.19/0.46
% 0.19/0.46 # Proof found!
% 0.19/0.46 # SZS status Theorem
% 0.19/0.46 # SZS output start CNFRefutation
% See solution above
% 0.19/0.46 # Parsed axioms : 33
% 0.19/0.46 # Removed by relevancy pruning/SinE : 25
% 0.19/0.46 # Initial clauses : 7
% 0.19/0.46 # Removed in clause preprocessing : 0
% 0.19/0.46 # Initial clauses in saturation : 7
% 0.19/0.46 # Processed clauses : 10
% 0.19/0.46 # ...of these trivial : 1
% 0.19/0.46 # ...subsumed : 0
% 0.19/0.46 # ...remaining for further processing : 9
% 0.19/0.46 # Other redundant clauses eliminated : 0
% 0.19/0.46 # Clauses deleted for lack of memory : 0
% 0.19/0.46 # Backward-subsumed : 0
% 0.19/0.46 # Backward-rewritten : 0
% 0.19/0.46 # Generated clauses : 1
% 0.19/0.46 # ...of the previous two non-redundant : 0
% 0.19/0.46 # ...aggressively subsumed : 0
% 0.19/0.46 # Contextual simplify-reflections : 0
% 0.19/0.46 # Paramodulations : 1
% 0.19/0.46 # Factorizations : 0
% 0.19/0.46 # NegExts : 0
% 0.19/0.46 # Equation resolutions : 0
% 0.19/0.46 # Disequality decompositions : 0
% 0.19/0.46 # Total rewrite steps : 5
% 0.19/0.46 # ...of those cached : 3
% 0.19/0.46 # Propositional unsat checks : 0
% 0.19/0.46 # Propositional check models : 0
% 0.19/0.46 # Propositional check unsatisfiable : 0
% 0.19/0.46 # Propositional clauses : 0
% 0.19/0.46 # Propositional clauses after purity: 0
% 0.19/0.46 # Propositional unsat core size : 0
% 0.19/0.46 # Propositional preprocessing time : 0.000
% 0.19/0.46 # Propositional encoding time : 0.000
% 0.19/0.46 # Propositional solver time : 0.000
% 0.19/0.46 # Success case prop preproc time : 0.000
% 0.19/0.46 # Success case prop encoding time : 0.000
% 0.19/0.46 # Success case prop solver time : 0.000
% 0.19/0.46 # Current number of processed clauses : 3
% 0.19/0.46 # Positive orientable unit clauses : 2
% 0.19/0.46 # Positive unorientable unit clauses: 0
% 0.19/0.46 # Negative unit clauses : 1
% 0.19/0.46 # Non-unit-clauses : 0
% 0.19/0.46 # Current number of unprocessed clauses: 3
% 0.19/0.46 # ...number of literals in the above : 3
% 0.19/0.46 # Current number of archived formulas : 0
% 0.19/0.46 # Current number of archived clauses : 6
% 0.19/0.46 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.46 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.46 # Non-unit clause-clause subsumptions : 0
% 0.19/0.46 # Unit Clause-clause subsumption calls : 0
% 0.19/0.46 # Rewrite failures with RHS unbound : 0
% 0.19/0.46 # BW rewrite match attempts : 0
% 0.19/0.46 # BW rewrite match successes : 0
% 0.19/0.46 # Condensation attempts : 10
% 0.19/0.46 # Condensation successes : 0
% 0.19/0.46 # Termbank termtop insertions : 737
% 0.19/0.46 # Search garbage collected termcells : 221
% 0.19/0.46
% 0.19/0.46 # -------------------------------------------------
% 0.19/0.46 # User time : 0.006 s
% 0.19/0.46 # System time : 0.000 s
% 0.19/0.46 # Total time : 0.006 s
% 0.19/0.46 # Maximum resident set size: 1896 pages
% 0.19/0.46
% 0.19/0.46 # -------------------------------------------------
% 0.19/0.46 # User time : 0.007 s
% 0.19/0.46 # System time : 0.003 s
% 0.19/0.46 # Total time : 0.009 s
% 0.19/0.46 # Maximum resident set size: 1748 pages
% 0.19/0.46 % E---3.1 exiting
% 0.19/0.47 % E exiting
%------------------------------------------------------------------------------